Discrepancy Bounds for Mixed Sequences
نویسنده
چکیده
A common measure for the uniformity of point distributions is the star discrepancy. Let λ s denote the s-dimensional Lebesgue measure. Then the star discrepancy of a mul-tiset P = {p 1 ,. .. , p N } ⊂ [0, 1] s is given by D * N (P) := sup α∈[0,1] s λ s ([0, α)) − 1 N N k=1 1 [0,α) (p k) ; here [0, α) denotes the s-dimensional axis-parallel box [0, α 1) × · · · × [0, α s) and 1 [0,α) its characteristic function. For an infinite sequence p in [0, 1] s we denote by D * N (p) the discrepancy of its first N points. The smallest star discrepancy of any N-point set is and the inverse of the star discrepancy is given by There are bounds known describing the behavior of the star discrepancy in the number of points N and in the dimension s
منابع مشابه
Probabilistic error bounds for the discrepancy of mixed sequences
In many applications Monte Carlo (MC) sequences or Quasi-Monte Carlo (QMC) sequences are used for numerical integration. In moderate dimensions the QMC method typically yield better results, but its performance significantly falls off in quality if the dimension increases. One class of randomized QMC sequences, which try to combine the advantages of MC and QMC, are so-called mixed sequences, wh...
متن کاملNew star discrepancy bounds for ( t , m , s ) - nets and ( t , s ) - sequences
In this paper, we derive new general upper bounds on the star discrepancy of (t,m, s)-nets and (t, s)-sequences. These kinds of point sets are among the most widely used in quasi-Monte Carlo methods for numerical integration. By our new results, we improve on previous discrepancy bounds and prove a conjecture stated by the second author in an earlier paper.
متن کاملA central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
In problems of moderate dimensions, the quasi-Monte Carlo method usually provides better estimates than the Monte Carlo method. However, as the dimension of the problem increases, the advantages of the quasi-Monte Carlo method diminish quickly. A remedy for this problem is to use hybrid sequences; sequences that combine pseudorandom and low-discrepancy vectors. In this paper we discuss a partic...
متن کاملOn Atanassov's methods for discrepancy bounds of low-discrepancy sequences
The aim of this survey paper is to give an updated overview of results on low discrepancy sequences obtained via Atanassov’s methods. These methods first initiated for Halton sequences have been later on extended to generalizations of these sequences and to (t, s)sequences, the other well known family of low discrepancy sequences, including polynomial arithmetic analogues of Halton sequences.
متن کاملSharp General and Metric Bounds for the Star Discrepancy of Perturbed Halton–kronecker Sequences
We consider distribution properties of two-dimensional hybrid sequences (zk)k in the unit square of the form zk = ({kα}, xk), where α ∈ (0, 1) is irrational and (xk)k denotes a digital Niederreiter sequence. By definition, the construction of the sequence (xk)k relies on an infinite matrix C with entries in {0, 1}. Two special cases of such matrices were studied by Niederreiter (2009) and by Ai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009